翻訳と辞書 Words near each other ・ Metric Martyrs ・ Metric mile ・ Metric modulation ・ Metric outer measure ・ Metric Pixel Canvas ・ Metric prefix ・ Metric signature ・ Metric space ・ Metric space aimed at its subspace ・ Metric Structures for Riemannian and Non-Riemannian Spaces ・ Metric system ・ Metric tensor ・ Metric tensor (general relativity) ・ Metric time ・ Metric Today ・ Metric tree ・ Metric typographic units ・ Metric-affine gravitation theory ・ Metrica ・ Metrical phonology ・ Metrical psalter ・ Metrical task system ・ Metrication ・ Metrication Board ・ Metrication in Australia ・ Metrication in Barbados ・ Metrication in Canada ・ Metrication in Chile ・ Metrication in Guatemala ・ Metrication in India Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Metric tree ： ウィキペディア英語版 Metric tree A metric tree is any tree data structure specialized to index data in metric spaces. Metric trees exploit properties of metric spaces such as the triangle inequality to make accesses to the data more efficient. Examples include the M-tree, vp-trees, cover trees, MVP Trees, and bk trees. ==Multidimensional search== Most algorithms and data structures for searching a dataset are based on the classical binary search algorithm, and generalizations such as the k-d tree or range tree work by interleaving the binary search algorithm over the separate coordinates and treating each spatial coordinate as an independent search constraint. These data structures are well-suited for range query problems asking for every point $(x,y)$ that satisfies $\backslash mbox\_x\; \backslash leq\; x\; \backslash leq\; \backslash mbox\_x$ and $\backslash mbox\_y\; \backslash leq\; y\; \backslash leq\; \backslash mbox\_y$. A limitation of these multidimensional search structures is that they are only defined for searching over objects that can be treated as vectors. They aren't applicable for the more general case in which the algorithm is given only a collection of objects and a function for measuring the distance or similarity between two objects. If, for example, someone were to create a function that returns a value indicating how similar one image is to another, a natural algorithmic problem would be to take a dataset of images and find the ones that are similar according to the function to a given query image. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Metric tree」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.